Towards Efficient Synthesis of ENL-systems

An attractive and challenging way of constructing complex computing systems is their automated synthesis from a range of behavioural specifications. In this paper, we explore one particular instance of this approach which aims at constructing a GALS (globally asynchronous locally synchronous) system from its behavioural specification given in terms of a suitable transition system. More precisely, the specification comes in the form of a transition system with arcs labelled by sets of events (steps), and the GALS system is represented by an Elementary Net System with Localities (ENL-system). Our aim here is to provide theoretical support for an efficient synthesis procedure, in particular, when it is not specified at the outset how the events are located. The synthesis procedure is based on the regions of a transition system, and we address the issue of generating a minimal set of such regions during the synthesis procedure. We introduce and study a special class of ENL-systems where there is no conflict between events coming from different localities. It turns out that in such a case the synthesis problem reduces to checking just one way of locating the events. © 2009 University of Newcastle upon Tyne. Printed and published by the University of Newcastle upon Tyne, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details KOUTNY, M., PIETKIEWICZ-KOUTNY, M. Towards Efficient Synthesis of ENL-systems [By] M. Koutny, M. Pietkiewicz-Koutny. Newcastle upon Tyne: University of Newcastle upon Tyne: Computing Science, 2009. (University of Newcastle upon Tyne, Computing Science, Technical Report Series, No. CS-TR-1141) Added entries UNIVERSITY OF NEWCASTLE UPON TYNE Computing Science. Technical Report Series. CS-TR-1141 Abstract An attractive and challenging way of constructing complex computing systems is their automated synthesis from a range of behavioural specifications. In this paper, we explore one particular instance of this approach which aims at constructing a GALS (globally asynchronous locally synchronous) system from its behavioural specification given in terms of a suitable transition system. More precisely, the specification comes in the form of a transition system with arcs labelled by sets of events (steps), and the GALS system is represented by an Elementary Net System with Localities (ENL-system). Our aim here is to provide theoretical support for an efficient synthesis procedure, in particular, when it is not specified at the outset how the events are located. The synthesis procedure is based on the regions of a transition system, and we address the issue of generating a minimal set of such regions during the synthesis procedure. About the author Maciej Koutny obtained his MSc (1982) and PhD (1984) from the Warsaw University of Technology. In 1985 he joined the then Computing Laboratory of the University of Newcastle upon Tyne to work as a Research Associate. In 1986 he became a Lecturer in Computing Science at Newcastle, and in 1994 was promoted to an established Readership at Newcastle. In 2000 he became a Professor of Computing Science. Marta Pietkiewicz-Koutny received her M.Sc. in Applied Mathematics from the Warsaw University of Technology in 1982. In 1984 she joined the Department of Operational Research, Institute of Econometrics in the Warsaw University of Economics where she worked as a junior lecturer until 1986. In 1987 she joined the Computing Laboratory of the University of Newcastle upon Tyne first as a research associate and then as a demonstrator (1988-1997). In the period 1997-2000 she was a Ph.D. student at the Department of Computing Science of the University of Newcastle upon Tyne, and in December 2000 she was awarded her Ph.D. degree. In the period 2000-2003 she was a researcher on the EU-funded DSoS (Dependable Systems of Systems) project, and in 2003 she was appointed a lecturer in the School of Computing Science. Dr. Pietkiewicz-Koutny’s research interests concentrate on modelling and validation of concurrent systems. The main topic of her research is the synthesis of Petri nets from transition systems.An attractive and challenging way of constructing complex computing systems is their automated synthesis from a range of behavioural specifications. In this paper, we explore one particular instance of this approach which aims at constructing a GALS (globally asynchronous locally synchronous) system from its behavioural specification given in terms of a suitable transition system. More precisely, the specification comes in the form of a transition system with arcs labelled by sets of events (steps), and the GALS system is represented by an Elementary Net System with Localities (ENL-system). Our aim here is to provide theoretical support for an efficient synthesis procedure, in particular, when it is not specified at the outset how the events are located. The synthesis procedure is based on the regions of a transition system, and we address the issue of generating a minimal set of such regions during the synthesis procedure. About the author Maciej Koutny obtained his MSc (1982) and PhD (1984) from the Warsaw University of Technology. In 1985 he joined the then Computing Laboratory of the University of Newcastle upon Tyne to work as a Research Associate. In 1986 he became a Lecturer in Computing Science at Newcastle, and in 1994 was promoted to an established Readership at Newcastle. In 2000 he became a Professor of Computing Science. Marta Pietkiewicz-Koutny received her M.Sc. in Applied Mathematics from the Warsaw University of Technology in 1982. In 1984 she joined the Department of Operational Research, Institute of Econometrics in the Warsaw University of Economics where she worked as a junior lecturer until 1986. In 1987 she joined the Computing Laboratory of the University of Newcastle upon Tyne first as a research associate and then as a demonstrator (1988-1997). In the period 1997-2000 she was a Ph.D. student at the Department of Computing Science of the University of Newcastle upon Tyne, and in December 2000 she was awarded her Ph.D. degree. In the period 2000-2003 she was a researcher on the EU-funded DSoS (Dependable Systems of Systems) project, and in 2003 she was appointed a lecturer in the School of Computing Science. Dr. Pietkiewicz-Koutny’s research interests concentrate on modelling and validation of concurrent systems. The main topic of her research is the synthesis of Petri nets from transition systems. Suggested keywords THEORY OF CONCURRENCY, PETRI NETS, ELEMENTARY NET SYSTEMS, LOCALITIES, ANALYSIS AND SYNTHESIS, STEP SEQUENCE SEMANTICS, CONFLICT, THEORY OF REGIONS, TRANSITION SYSTEMS Towards Efficient Synthesis of ENL-systems Maciej Koutny and Marta Pietkiewicz-Koutny School of Computing Science Newcastle University Newcastle upon Tyne, NE1 7RU United Kingdom {maciej.koutny,marta.koutny}@newcastle.ac.uk Abstract. An attractive and challenging way of constructing complex computing systems is their automated synthesis from a range of behavioural specifications. In this paper, we explore one particular instance of this approach which aims at constructing a GALS (globally asynchronous locally synchronous) system from its behavioural specification given in terms of a suitable transition system. More precisely, the specification comes in the form of a transition system with arcs labelled by sets of events (steps), and the GALS system is represented by an Elementary Net System with Localities (ENL-system). Our aim here is to provide theoretical support for an efficient synthesis procedure, in particular, when it is not specified at the outset how the events are located. The synthesis procedure is based on the regions of a transition system, and we address the issue of generating a minimal set of such regions during the synthesis procedure. We introduce and study a special class of ENL-systems where there is no conflict between events coming from different localities. It turns out that in such a case the synthesis problem reduces to checking just one way of locating the events.